One-Rule Length-Preserving Rewrite Systems and Rational Transductions
نویسندگان
چکیده
منابع مشابه
On Termination of One Rule Rewrite Systems
The undecidability of the termination of rewrite systems is usually proved by reduction to the halting of Turing machines. In particular, Dauchet proves the unde-cidability of the termination of one rule rewrite systems by coding Turing machines into one rule rewrite systems. Rewrite systems are a very simple model of computation and one may expect proofs in this model to be more straightforwar...
متن کاملIteration of rational transductions
The purpose of this paper is to show connections between iterated length preserving rational transductions and linear space computations Hence we study the smallest family of transductions containing length preserving rational transductions and closed under union composition and iteration We give several characterizations of this class using re stricted classes of length preserving rational tra...
متن کاملRewrite Rule Systems for Modal Propositional Logic
D This paper explains new results relating modal propositional logic and rewrite rule systems. More precisely, we give complete term rewriting systems for the modal propositional systems known as K, Q, T, and S5. These systems are presented as extensions of Hsiang’s system for classical propositional calculus. We have checked local confluence with the rewrite rule system K.B. (cf. the Knuth-Ben...
متن کاملLogical and Algebraic Characterizations of Rational Transductions
Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic. The robust subclass of aperiodic languages is defined by: counter-free automata, star-free expressions, aperiodic (finite) congruences, or first-order (FO) logic. In particular, their algebraic characterization by aperiodic con...
متن کاملRewrite Systems for Natural, Integral, and Rational Arithmetic
We give algebraic presentations of the sets of natural numbers , integers, and rational numbers by convergent rewrite systems which moreover allow eecient computations of arithmetical expressions. We then use such systems in the general normalised completion algorithm, in order to compute Grrbner bases of polynomial ideals over Q.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2014
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2013044